But moving backward is more complicated, because internally the iterator performs a depth-first, preorder traversal of the Rope, visiting each of its leaf nodes. 但是向后移动要复杂些,因为迭代器内部执行的是深度优先算法,预先排好了Rope遍历的顺序,需要访问每个叶节点。
At present, preorder traversal algorithm is wildly used for OID serializing. However, great maintenance overhead is inevitable when we adopt this algorithm. 现在普遍采用的OID序列化方法是前序算法,但是该算法代价很大。
Vessel segments in two images are matched by the preorder traversal of the binary trees, and the method is proved fast and accurate. 同时根据二叉树的前序遍历结果匹配血管段,有效地提高了匹配的速度和准确度。
In the data structure, the binary tree can be uniquely confirmed when the nodes sequences of this binary tree for preorder traversal and inorder traversal are knows. 在数据结构中,已知一棵二叉树的先序序列和中序序列,可唯一确定此二叉树。
An Extended Quadtree Structure and Its Preorder Traversal Algorithm 一种可扩展四叉树结构及其先序遍历算法
This paper summarizes the relation of the three different array through the analysis of getting three different array from the same tree using three different algorithm: preorder traversal, inorder traversal and postorder traversal. 通过对同一棵二叉树的先序遍历、中序遍历、后序遍历得到三个不同序列的分析,概括出二叉树前中后序遍历序列间的关系。